package com.flower.algorithm.linklist;

/**
 * @ClassName DListNode
 * @Description 双向链表 带头结点
 * @Author 吃麻椒的花酱
 * @Date 2021/11/9 13:47
 * @Version 1.0
 */
public class DListNode {
    public int val;
    public DListNode next;
    public DListNode pre;
    public DListNode() {}
    public DListNode(int val) { this.val = val; }
    public DListNode(int val, DListNode next,DListNode pre) {
        this.val = val;
        this.pre = pre;
        this.next = next; }

}
